Covering tori with squares
نویسندگان
چکیده
منابع مشابه
Covering Segments with Unit Squares
We study several variations of line segment covering problem with axis-parallel unit squares in IR. A set S of n line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give...
متن کاملCovering by squares
In this paper we introduce the “do not touch” condition for squares in the discrete plane. We say that two squares “do not touch” if they do not share any vertex or any segment of an edge. Using this condition we define a covering of the discrete plane, the covering can be strong or weak, regular or non-regular. For simplicity, in this article, we will restrict our attention to regular covering...
متن کاملStrong covering without squares
The study of “covering lemmas” started with Jensen [DeJe] who proved in 1974–5 that in the absence of 0 there is a certain degree of resemblance between V and L. More precisely, if 0 does not exist then for every set of ordinals X there exists a set of ordinals Y ∈ L such that X ⊆ Y and V 2 |Y | = max{|X|,א1}. There is no hope of covering countable sets by countable ones in general, because doi...
متن کاملApproximation Algorithms for Covering Polygons with Squares and Similar Problems
We consider the problem of covering polygons, without any acute interior angles, using a preferably minimum number of squares. The squares must lie entirely within the polygon. Let P be an arbitrary input polygon, with n vertices, coverable by squares. Let (P) denote the minimum number of squares required to cover P. In the rst part of this paper we show an O(n log n+(P)) time algorithm which p...
متن کاملCovering point sets with two disjoint disks or squares
We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red points covered by CR plus the number of blue points covered by CB is maximized. We give an algorithm to solve this problem in O(n log n) time, where n denotes the total number of points. We also show that the analogous...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1973
ISSN: 0097-3165
DOI: 10.1016/0097-3165(73)90069-1